Global minimization of rational functions and the nearest GCDs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global minimization of rational functions and the nearest GCDs

This paper discusses the global minimization of rational functions with or without constraints. The sum of squares (SOS) relaxations are proposed to find the global minimum and minimizers. Some special features of the SOS relaxations are studied. As an application, we show how to find the nearest common divisors of polynomials via global minimization of rational functions. keywords: Rational fu...

متن کامل

the relationship between field-related cognitive styles and global reading comprehension of hypertext

this study investigates the relationship between field-related cognitive styles and global reading comprehension of hypertext. technically, field dependency is prevailing dominance of field on perception of parts, while global comprehension is skim-like reading to grasp the general content. in this research project, 60 senior and junior students of arak university majoring in english literature...

15 صفحه اول

Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs

We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton–Padé, Hermite–Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given probl...

متن کامل

Global Optimization of Rational Multivariate Functions

The paper deals with unconstrained global minimization of rational functions. A necessary condition is given for the function to have a nite innmum. In case the condition is satissed, the problem is shown to be equivalent to a speciic constrained polynomial optimization problem. In this paper, we solve a relaxation of the latter formulation using semi-deenite programming. In general, the relaxa...

متن کامل

On characterizations of the fully rational fuzzy choice functions

In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2006

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-006-9119-8